Compact symmetric spaces , triangular factorization , and Cayley coordinates Derek Habermas
نویسنده
چکیده
Let U/K represent a connected, compact symmetric space, where θ is an involution of U that fixes K, φ : U/K → U is the geodesic Cartan embedding, and G is the complexification of U. We investigate the intersection, studied by Pickrell, of φ(U/K) with the Birkhoff decomposition of G corresponding to a θ-stable triangular, or LDU, factoriztion of Lie(G). When g ∈ φ(U/K) is generic, the factorization g = ldu is unique. In this paper we present explicit formulas for d in Cayley coordinates for several classes of symmetric spaces, and use them to compute the connected components of the " top level, " or generic part, of φ(U/K). These formulas are also useful in explicitly calculating Evens-Lu Poisson structures on U/K, also studied by Foth, Otto, and Caine, and for computing related integrals using elementary techniques.
منابع مشابه
Compact Symmetric Spaces, Triangular Factorization, and Poisson Geometry
LetX be a simply connected compact Riemannian symmetric space, let U be the universal covering group of the identity component of the isometry group of X , and let g denote the complexification of the Lie algebra of U , g = u. Each u-compatible triangular decomposition g = n − + h + n+ determines a Poisson Lie group structure πU on U . The Evens-Lu construction ([EL]) produces a (U, πU )-homoge...
متن کاملChallenges for extending Discretizable Molecular Distance Geometry to interval data
The existence of an embedding in R satisfying a set of exact distances can be verified by the Cayley-Menger conditions [2]. In the MDGP, a set of distances is embeddable if and only if all Cayley-Menger determinants of 3 and 4 points have the correct sign(corresponding to the triangular and tetrangular inequalities) and the ones of 5 and 6 points vanish. Another way to verify the embeddability ...
متن کاملPacked Storage Extension for ScaLAPACK
We describe an extension to ScaLAPACK for computing with symmetric (and hermitian) matrices stored in a packed form. This is similar to the compact storage for symmetric (and hermitian) matrices available in LAPACK [2]. This enables more efficient use of memory by storing only the lower or upper triangular part of a symmetric matrix. The capabilities include Choleksy factorization (PxSPTRF) and...
متن کاملCOMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
متن کاملCommunication-Avoiding Symmetric-Indefinite Factorization
We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen’s triangular tridiagonalization. It factors a dense symmetric matrix A as the product A = PLTLP where P is a permutation matrix, L is lower triangular, and T is block tridiagonal and banded. The algorithm is the first symmetric-indefinite communication-avoiding fac...
متن کامل